Erratum: Fast Density-Based Clustering Using Graphics Processing Units [IEICE Transactions on Information and Systems Vol.E97.D (2014) , No.5 pp.1349-1352]

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fast Poisson Solvers for Graphics Processing Units

Two block cyclic reduction linear system solvers are considered and implemented using the OpenCL framework. The topics of interest include a simplified scalar cyclic reduction tridiagonal system solver and the impact of increasing the radix-number of the algorithm. Both implementations are tested for the Poisson problem in two and three dimensions, using a Nvidia GTX 580 series GPU and double p...

متن کامل

Fast free-form deformation using graphics processing units

A large number of algorithms have been developed to perform non-rigid registration and it is a tool commonly used in medical image analysis. The free-form deformation algorithm is a well-established technique, but is extremely time consuming. In this paper we present a parallel-friendly formulation of the algorithm suitable for graphics processing unit execution. Using our approach we perform r...

متن کامل

Fast MR Image Reconstruction using Graphics Processing Units

INTRODUCTION The computational cost of image reconstruction is an important practical issue. Although conventional fast Fourier transform (FFT) reconstructions are fast, many important emerging algorithms are computationally more expensive, including notable iterative algorithms designed for non-Cartesian k-space data, parallel imaging data, or data contaminated by physical effects like field i...

متن کامل

Fast Free-Form Deformation using the Normalised Mutual Information gradient and Graphics Processing Units

Non-rigid registration is a tool commonly used in medical image analysis. However techniques are usually time consuming. In this paper we present a fast registration framework which is a modification of the well-known Free-Form Deformation (FFD) algorithm. Our algorithm uses the analytical Normalized Mutual Information gradient which leads to a highly parallel framework. Its implementation is t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEICE Transactions on Information and Systems

سال: 2014

ISSN: 0916-8532,1745-1361

DOI: 10.1587/transinf.e97.d.1947